Transport relocation

ABSTRACT

An example operation may include one or more of detecting, by a parking processing node, a parking of a transport at an event location, accessing, by the parking processing node, a device of a transport occupant to determine a transport pickup location and a pickup time based on a conclusion of an event, detecting, by the parking processing node, from the device of the transport occupant at least one modification of the pickup location and the pickup time made based on an updated conclusion of the event, and sending a command to move the transport to a location proximate to the event based on the modified pickup location and the modified pickup time.

TECHNICAL FIELD

This application generally relates to location of parking fortransports, and more particularly, to transport relocation.

BACKGROUND

Vehicles or transports, such as cars, motorcycles, trucks, planes,trains, etc., generally provide transportation needs to occupants and/orgoods in a variety of ways. Functions related to transports may beidentified and utilized by various computing devices, such as asmartphone or a computer, or a tablet.

Transport parking lots and parking garages may have signs that indicateavailability of parking spots. For example, a parking location may havelighted signs to indicate that the parking location may be accessible.However, even when the parking spots are available, it is often verydifficult to know the exact location of these spaces. It is also hard todetermine which spot is the closest or the most convenient.

Accordingly, an efficient and secure way for directing the transports tothe available parking spots and for automated relocation of thetransport to more accessible parking spots based on an immutable storageis desired.

SUMMARY

One example embodiment may provide a method that includes one or more ofdetecting, by a parking processing node, a parking of a transport at anevent location, accessing, by the parking processing node, a device of atransport occupant to determine a transport pickup location and a pickuptime based on a conclusion of an event, detecting, by the parkingprocessing node, from the device of the transport occupant at least onemodification of the pickup location and the pickup time made based on anupdated conclusion of the event, and sending a command to move thetransport to a location proximate to the event based on the modifiedpickup location and the modified pickup time.

Another example embodiment may provide a method that includes one ormore of receiving, by a destination processing node, a notification froma transport regarding a probable vacancy, determining, by thedestination processing node, a probable time of availability and alocation of the vacancy based on the notification, querying, by thedestination processing node, a plurality of transports in a proximity ofthe vacancy, and assigning the location of the vacancy to a specifictransport of the plurality of the transports.

Yet another example embodiment may provide a method that includes one ormore of querying, by a transport, a plurality of transports within aparking area for a parking spot to be vacated, receiving, by thetransport, verification to vacate the parking spots from the pluralityof transports within the parking area, and determining, by thetransport, locations of the parking spots to be vacated based on theverifications.

Another example embodiment may provide a system that includes aprocessor and memory, wherein the processor is configured to perform oneor more of detect a parking of a transport at an event location, accessa device of a transport occupant to determine a transport pickuplocation and a pickup time based on a conclusion of an event, detectfrom the device of the transport occupant at least one modification ofthe pickup location and the pickup time made based on an updatedconclusion of the event, and send a command to move the transport to alocation proximate to the event based on the modified pickup locationand the modified pickup time.

Another example embodiment may provide a system that includes aprocessor and memory, wherein the processor is configured to perform oneor more of receive a notification from a transport regarding a probablevacancy, determine a probable time of availability and a location of thevacancy based on the notification, query a plurality of transports in aproximity of the vacancy, and assign the location of the vacancy to aspecific transport of the plurality of the transports.

Yet another example embodiment may provide a system that includes aprocessor and memory, wherein the processor is configured to perform oneor more of query a plurality of transports within a parking area for aparking spot to be vacated, receive verification to vacate the parkingspots from the plurality of transports within the parking area, anddetermine locations of the parking spots to be vacated based on theverifications.

A further example embodiment provides a non-transitory computer readablemedium comprising instructions, that when read by a processor, cause theprocessor to perform one or more of detecting a parking of a transportat an event location, accessing a device of a transport occupant todetermine a transport pickup location and a pickup time based on aconclusion of an event, detecting from the device of the transportoccupant at least one modification of the pickup location and the pickuptime made based on an updated conclusion of the event, and sending acommand to move the transport to a location proximate to the event basedon the modified pickup location and the modified pickup time.

A further example embodiment provides a non-transitory computer readablemedium comprising instructions, that when read by a processor, cause theprocessor to perform one or more of receiving a notification from atransport regarding a probable vacancy, determining a probable time ofavailability and a location of the vacancy based on the notification,querying a plurality of transports in a proximity of the vacancy, andassigning the location of the vacancy to a specific transport of theplurality of the transports.

Yet a further example embodiment provides a non-transitory computerreadable medium comprising instructions, that when read by a processor,cause the processor to perform one or more of querying a plurality oftransports within a parking area for a parking spot to be vacated,receiving verification to vacate the parking spots from the plurality oftransports within the parking area, and determining locations of theparking spots to be vacated based on the verifications.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates a transport(s) network diagram in accordance to theexample embodiments.

FIG. 1B illustrates an example network diagram including a transportnode, according to example embodiments.

FIG. 1C illustrates another example network diagram including atransport node, according to example embodiments.

FIG. 1D illustrates another example network diagram including atransport node, according to example embodiments.

FIG. 2A illustrates a blockchain architecture configuration, accordingto example embodiments.

FIG. 2B illustrates another blockchain configuration, according toexample embodiments.

FIG. 2C illustrates a blockchain configuration for storing blockchaintransaction data, according to example embodiments.

FIG. 3A illustrates a flow diagram, according to example embodiments.

FIG. 3B illustrates another flow diagram, according to exampleembodiments.

FIG. 3C illustrates a further flow diagram, according to exampleembodiments.

FIG. 3D illustrates yet a further flow diagram, according to exampleembodiments.

FIG. 3E illustrates a further flow diagram, according to exampleembodiments.

FIG. 3F illustrates yet a further flow diagram, according to exampleembodiments.

FIG. 4A illustrates an example blockchain vehicle configuration formanaging blockchain transactions associated with a vehicle, according toexample embodiments.

FIG. 4B illustrates another example blockchain vehicle configuration formanaging blockchain transactions between a service center and a vehicle,according to example embodiments.

FIG. 4C illustrates yet another example blockchain vehicle configurationfor managing blockchain transactions conducted among various vehicles,according to example embodiments

FIG. 5 illustrates example data blocks, according to exampleembodiments.

FIG. 6 illustrates an example system that supports one or more of theexample embodiments.

DETAILED DESCRIPTION

It will be readily understood that the instant components, as generallydescribed and illustrated in the figures herein, may be arranged anddesigned in a wide variety of different configurations. Thus, thefollowing detailed description of the embodiments of at least one of amethod, apparatus, non-transitory computer readable medium and system,as represented in the attached figures, is not intended to limit thescope of the application as claimed but is merely representative ofselected embodiments.

The instant features, structures, or characteristics as describedthroughout this specification may be combined in any suitable manner inone or more embodiments. For example, the usage of the phrases “exampleembodiments”, “some embodiments”, or other similar language, throughoutleast this specification refers to the fact that a particular feature,structure, or characteristic described in connection with the embodimentmay be included in at one embodiment. Thus, appearances of the phrases“example embodiments”, “in some embodiments”, “in other embodiments”, orother similar language, throughout this specification do not necessarilyall refer to the same group of embodiments, and the described features,structures, or characteristics may be combined in any suitable manner inone or more embodiments. In the diagrams, any connection betweenelements can permit one-way and/or two-way communication even if thedepicted connection is a one-way or two-way arrow. In the currentapplication, a transport may include one or more of cars, trucks,motorcycles, scooters, bicycles, boats, recreational vehicles, planes,and any object that may be used to transport people and or goods fromone location to another.

In addition, while the term “message” may have been used in thedescription of embodiments, the application may be applied to many typesof network data, such as, a packet, frame, datagram, etc. The term“message” also includes packet, frame, datagram, and any equivalentsthereof. Furthermore, while certain types of messages and signaling maybe depicted in exemplary embodiments they are not limited to a certaintype of message, and the application is not limited to a certain type ofsignaling.

Example embodiments provide methods, systems, components, non-transitorycomputer readable media, devices, and/or networks, which provide atleast one of: a transport (also referred to as a vehicle herein) a datacollection system, a data monitoring system, a verification system, anauthorization system and a vehicle data distribution system. The vehiclestatus condition data, received in the form of communication updatemessages, such as wireless data network communications and/or wiredcommunication messages, may be received and processed to identifyvehicle/transport status conditions and provide feedback as to thecondition changes of a transport. In one example, a user profile may beapplied to a particular transport/vehicle to authorize a current vehicleevent, service stops at service stations, and to authorize subsequentvehicle rental services.

Within the communication infrastructure, a decentralized database is adistributed storage system, which includes multiple nodes thatcommunicate with each other. A blockchain is an example of adecentralized database, which includes an append-only immutable datastructure (i.e., a distributed ledger) capable of maintaining recordsbetween untrusted parties. The untrusted parties are referred to hereinas peers, nodes or peer nodes. Each peer maintains a copy of thedatabase records and no single peer can modify the database recordswithout a consensus being reached among the distributed peers. Forexample, the peers may execute a consensus protocol to validateblockchain storage entries, group the storage entries into blocks, andbuild a hash chain via the blocks. This process forms the ledger byordering the storage entries, as is necessary, for consistency. In apublic or permissionless blockchain, anyone can participate without aspecific identity. Public blockchains can involve crypto-currencies anduse consensus based on various protocols such as proof of work (PoW). Onthe other hand, a permissioned blockchain database provides a system,which can secure interactions among a group of entities which share acommon goal, but which do not or cannot fully trust one another, such asbusinesses that exchange funds, goods, information, and the like. Theinstant application can function in a permissioned and/or apermissionless blockchain setting.

Smart contracts are trusted distributed applications which leveragetamper-proof properties of the shared or distributed ledger (i.e., whichmay be in the form of a blockchain) database and an underlying agreementbetween member nodes which is referred to as an endorsement orendorsement policy. In general, blockchain entries are “endorsed” beforebeing committed to the blockchain while entries, which are not endorsed,are disregarded. A typical endorsement policy allows smart contractexecutable code to specify endorsers for an entry in the form of a setof peer nodes that are necessary for endorsement. When a client sendsthe entry to the peers specified in the endorsement policy, the entry isexecuted to validate the entry. After validation, the entries enter anordering phase in which a consensus protocol is used to produce anordered sequence of endorsed entries grouped into blocks.

Nodes are the communication entities of the blockchain system. A “node”may perform a logical function in the sense that multiple nodes ofdifferent types can run on the same physical server. Nodes are groupedin trust domains and are associated with logical entities that controlthem in various ways. Nodes may include different types, such as aclient or submitting- client node which submits an entry-invocation toan endorser (e.g., peer), and broadcasts entry-proposals to an orderingservice (e.g., ordering node). Another type of node is a peer node,which can receive client submitted entries, commit the entries andmaintain a state and a copy of the ledger of blockchain entries. Peerscan also have the role of an endorser, although it is not a requirement.An ordering-service-node or orderer is a node running the communicationservice for all nodes, and which implements a delivery guarantee, suchas a broadcast to each of the peer nodes in the system when committingentries and modifying a world state of the blockchain, which is anothername for the initial blockchain entry, which normally includes controland setup information.

A ledger is a sequenced, tamper-resistant record of all statetransitions of a blockchain. State transitions may result from smartcontract executable code invocations (i.e., entries) submitted byparticipating parties (e.g., client nodes, ordering nodes, endorsernodes, peer nodes, etc.). An entry may result in a set of assetkey-value pairs being committed to the ledger as one or more operands,such as creates, updates, deletes, and the like. The ledger includes ablockchain (also referred to as a chain), which is used to store animmutable, sequenced record in blocks. The ledger also includes a statedatabase, which maintains a current state of the blockchain. There istypically one ledger per channel. Each peer node maintains a copy of theledger for each channel of which they are a member.

A chain is an entry log, which is structured as hash-linked blocks, andeach block contains a sequence of N entries where N is equal to orgreater than one. The block header includes a hash of the block'sentries, as well as a hash of the prior block's header. In this way, allentries on the ledger may be sequenced and cryptographically linkedtogether. Accordingly, it is not possible to tamper with the ledger datawithout breaking the hash links. A hash of a most recently addedblockchain block represents every entry on the chain that has comebefore it, making it possible to ensure that all peer nodes are in aconsistent and trusted state. The chain may be stored on a peer nodefile system (i.e., local, attached storage, cloud, etc.), efficientlysupporting the append-only nature of the blockchain workload.

The current state of the immutable ledger represents the latest valuesfor all keys that are included in the chain entry log. Because thecurrent state represents the latest key values known to a channel, it issometimes referred to as a world state. Smart contract executable codeinvocations execute entries against the current state data of theledger. To make these smart contract executable code interactionsefficient, the latest values of the keys may be stored in a statedatabase. The state database may be simply an indexed view into thechain's entry log, it can therefore be regenerated from the chain at anytime. The state database may automatically be recovered (or generated ifneeded) upon peer node startup, and before entries are accepted.

A blockchain is different from a traditional database in that theblockchain is not a central storage but rather a decentralized,immutable, and secure storage, where nodes must share in changes torecords in the storage. Some properties that are inherent in blockchainand which help implement the blockchain include, but are not limited to,an immutable ledger, smart contracts, security, privacy,decentralization, consensus, endorsement, accessibility, and the like.

Example embodiments provide a way for providing a vehicle service to aparticular vehicle and/or requesting user associated with a user profilethat is applied to the vehicle. For example, a user may be the owner ofa vehicle or the operator of a vehicle owned by another party. Thevehicle may require service at certain intervals and the service needsmay require authorization prior to permitting the services to bereceived. Also, service centers may offer services to vehicles in anearby area based on the vehicle's current route plan and a relativelevel of service requirements (e.g., immediate, severe, intermediate,minor, etc.). The vehicle needs may be monitored via one or moresensors, which report sensed data to a central controller computerdevice in the vehicle, which in turn, is forwarded to a managementserver for review and action.

A sensor may be located on one or more of the interior of the transport,the exterior of the transport, on a fixed object apart from thetransport, and on another transport near to the transport. The sensormay also be associated with the transport's speed, the transport'sbraking, the transport's acceleration, fuel levels, service needs, thegear-shifting of the transport, the transport's steering, and the like.The notion of a sensor may also be a device, such as a mobile device.Also, sensor information may be used to identify whether the vehicle isoperating safely and whether the occupant user has engaged in anyunexpected vehicle conditions, such as during the vehicle access period.Vehicle information collected before, during and/or after a vehicle'soperation may be identified and stored in a transaction on ashared/distributed ledger, which may be generated and committed to theimmutable ledger as determined by a permission granting consortium, andthus in a “decentralized” manner, such as via a blockchain membershipgroup. Each interested party (i.e., company, agency, etc.) may want tolimit the exposure of private information, and therefore the blockchainand its immutability can limit the exposure and manage permissions foreach particular user vehicle profile. A smart contract may be used toprovide compensation, quantify a user profile score/rating/review, applyvehicle event permissions, determine when service is needed, identify acollision and/or degradation event, identify a safety concern event,identify parties to the event and provide distribution to registeredentities seeking access to such vehicle event data. Also, the resultsmay be identified, and the necessary information can be shared among theregistered companies and/or individuals based on a “consensus” approachassociated with the blockchain. Such an approach could not beimplemented on a traditional centralized database.

Every autonomous driving system is built on a whole suite of softwareand an array of sensors. Machine learning, lidar projectors, radar, andultrasonic sensors all work together to create a living map of the worldthat a self-driving car can navigate. Most companies in the race to fullautonomy are relying on the same basic technological foundations oflidar+radar+cameras+ultrasonic, with a few notable exceptions.

In another embodiment, GPS, maps and other cameras and sensors are usedin an autonomous vehicles without lidar as lidar is often viewed asbeing expensive and unnecessary. Researchers have determined that stereocameras are a low-cost alternative to the more expensive lidarfunctionality.

The instant application includes, in certain embodiments, authorizing avehicle for service via an automated and quick authentication scheme.For example, driving up to a charging station or fuel pump may beperformed by a vehicle operator, and the authorization to receive chargeor fuel may be performed without any delays provided the authorizationis received by the service station. A vehicle may provide acommunication signal that provides an identification of a vehicle thathas a currently active profile linked to an account that is authorizedto accept a service, which can be later rectified by compensation.Additional measures may be used to provide further authentication, suchas another identifier may be sent from the user's device wirelessly tothe service center to replace or supplement the first authorizationeffort between the transport and the service center with an additionalauthorization effort.

Data shared and received may be stored in a database, which maintainsdata in one single database (e.g., database server) and generally at oneparticular location. This location is often a central computer, forexample, a desktop central processing unit (CPU), a server CPU, or amainframe computer. Information stored on a centralized database istypically accessible from multiple different points. A centralizeddatabase is easy to manage, maintain, and control, especially forpurposes of security because of its single location. Within acentralized database, data redundancy is minimized as a single storingplace of all data also implies that a given set of data only has oneprimary record.

According to one exemplary embodiment, a parking processing systemtracks a transport user-occupant's device (e.g., a Smartphone, a watchor a tablet) and modifies a transport pickup location and time so thetransport can be moved to another parking spot closer to the modifiedfinal location of the transport after an event. This approach may takeinto account delays and modifications to the event's schedule. Accordingthe exemplary embodiment, a transport may be parked during the event ina parking spot associated with a location (such as an airport, a trainstation, or any area where a large number of transports congregate) andat the conclusion of the event, the transport may be moved to a locationproximate to the transport occupant's device. The exemplary embodimentcan be particularly applicable to autonomous vehicles that movethemselves at the right time upon receiving a command. Calibrating of aparking location based on an amount of time the transport occupant isexpected to be at the event and moving the transport to the occupant'slocation at the conclusion of the event can be impacted by othertransports. For example, an airplane carrying the user may experiencedelays, cancellations, additional time at the jet bridge, etc. Thesystem may alert the transport of such delays and the transport mayreact accordingly (such as returning to the original parking spot ormoving from the original parking spot to an intermediate parking spotcloser to the final pickup location). When the delay or cancellationwait has ended, the parking processing system moves the transport to alocation proximate to the transport occupant's device when the deviceapproaches the user's final pickup location.

In another exemplary embodiment, an indication from one specifictransport (that is about to vacate a location) is provided to anothertransport that is seeking to occupy the location. In this embodiment,only the transports are involved via V2V communication. The exemplaryembodiment ensures the most optimal placement of a transport at aphysical location. In yet another embodiment, the application utilizes aserver node to direct the communication to the transports and providerequisite parking instructions. In either scenario, a blockchain is usedto perform authentication and coordination of placement of the transportat the location.

In yet another embodiment, a transport destination system storesphysical locations available for occupancy by transports in ablockchain. For example, the physical location may be a public parkingspace, a private garage, a turntable for sensor testing, etc. Once atransport is about to vacate the physical location, the transportdestination system receives a notification. Note that this step isdifferent from a situation where a transport has already vacated aphysical location. Then, the transport destination system may query thetransports that are currently in the proximity of the parking spot thatis about to be vacated. These transports may be, for example, alreadyinside a parking garage, waiting outside the garage or about to enter aparticular area, next in line at a valet or in line for a qualityassurance testing, etc.

The transport destination system determines that the transport is aboutto vacate (has not yet vacated) a particular location, in a number ofways. In one embodiment, the transport is turned off and the systemrecognizes that an occupant has left the transport. This may occur viaan object(s) such as a camera, a motion sensor, a door sensor located onthe interior or exterior of the transport. After a certain period oftime, the transport may determine that the occupant has effectively leftthe transport (i.e., a period of time is needed to ensure the user isnot returning to the transport in the event that an item needed to beretrieved from the transport, for example). Same objects may be used todetermine that the user is returning to the transport after the certainperiod of time. At that juncture, the transport notifies the transportdestination system that it will vacate the physical location. In anotherembodiment, the transport can determine a time associated with a userexiting the transport and walking away from the transport at aparticular distance. At that particular distance, when the transportrecognizes the user, a similar period of time can be used as a basis forfurther determining when the transport will vacate the spot. In oneexample, if a user exited the transport and was at a particular distance15 seconds later, when the user is at, or around, that particulardistance, the transport can estimate it will take the user approximately15 seconds to re-enter the transport and to prepare to vacate thelocation. The transport may further determine that the user may needadditional time prior to vacating the physical destination (for example,the transport may determine that an additional person(s) may be walkingalongside the user at the particular distance, may determine the user isin possession of various items such as packages, bags, etc. that werenot previously present, the transport may determine that the user iswalking slower within the particular distance to the transport than waspreviously noted between the transport and the particular distance (forexample, the user may be interfacing with a communication device), etc.This additional time, in conjunction with the certain period of time canbe used to determine when the transport will vacate the physicallocation. In the exemplary embodiments, the transports and the transportdestination system may communicate via a blockchain network. In such ascenario, the plurality of transports are associated with a blockchainconsensus, and the system may execute a smart contract to query theplurality of transports proximate to the vacancy for agreements tooccupy the location of the vacancy.

In yet another embodiment, the parking spot vacancy is processed from apoint of view of a transport that is looking for parking. In thisembodiment, the transport communicates with other transports directly(i.e., without involvement of a destination processing node). Once thetransport approaches a parking spot, the transport may query thetransports in the parking lot for parking spot vacation over ablockchain network. Then, the transport may receive agreements from thetransports that are about to leave their parking spots. The agreementmay contain a location of the spot to be vacated and a time of avacation. The transport may select a nearest parking spot to be vacatedor a parking spot that will be vacated the earliest. In one example, thetransport(s) may be traveling on a nearby street and checking if it ispossible to park in the parking area or in the garage. In other words,all of the transports connected over the blockchain network and parkedwithin a certain distance from the transport may be notified. Then, thetransport may notify the transport in the selected parking spot so thatthe transport can wait for the transport to arrive before pulling out ofthe spot. In other words, a consensus to leave the spot and to provideit to another party on the blockchain is reached prior to parking of thetransport.

FIG. 1A illustrates a transport(s) network diagram 100 in accordance tothe exemplary embodiments. According to one exemplary embodiment, aparking processing node 107 may detect a parking of a transport 102 atan event location. The parking processing node 107 may access a device(e.g., a Smartphone) of a transport 102 occupant to determine atransport pickup location and a pickup time based on a conclusion of anevent. The parking processing node 107 may detect from the device of thetransport occupant a modification of the pickup location and the pickuptime made based on updated conclusion of the event and may send acommand to move the transport 102 to a location proximate to the eventbased on the modified pickup location and pickup time. Parking locationsof other transport nodes 105 may be taken into consideration.

According to another exemplary embodiment, the destination processingnode 107 may receive a notification from a transport 102 regarding aprobable vacancy. The destination processing node 107 may determine aprobable time of availability and a location of the vacancy based on thenotification. The destination processing node 107 may query a pluralityof transports 105 in a proximity of the vacancy and may assign thelocation of the vacancy to a specific transport of the plurality of thetransports 105.

According to yet another exemplary embodiment, the transport 102 mayquery a plurality of transports 105 within a parking area for a parkingspot to be vacated. The transport 102 may receive verifications tovacate the parking spots from the plurality of transports 105 within theparking area and may determine locations of the parking spots to bevacated based on the verifications.

The parking processing node 107 may have a computing device or a servercomputer, or the like, and may include a processor 104, which may be asemiconductor-based microprocessor, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field-programmablegate array (FPGA), and/or another hardware device. Although a singleprocessor 104 is depicted, it should be understood that the parkingprocessing node 107 may include multiple processors, multiple cores, orthe like, without departing from the scope of the parking processingnode 107 system. The parking processing node 107 may also include anon-transitory computer readable medium that may have stored thereonmachine-readable instructions executable by the processor 104′.

FIG. 1B illustrates a network diagram for transport relocation.Referring to FIG. 1B, the network diagram 111 includes a transport node102 connected to other transport nodes 105 over a blockchain network106. The transport nodes 102 and 105 may represent transports/vehicles.The blockchain network 106 may have ledger 108 for storing data, such astransport locations and relocation transactions 110 that record thetimestamps, and other related data. The transport node 102 may beconnected to a parking processing node 107 via the blockchain 106.

While this example describes in detail only one parking processing node107, multiple such nodes may be connected to the blockchain 106. Itshould be understood that the parking processing node 107 may includeadditional components and that some of the components described hereinmay be removed and/or modified without departing from a scope of theparking processing node 107 disclosed herein. The parking processingnode 107 may have a computing device or a server computer, or the like,and may include a processor 104, which may be a semiconductor-basedmicroprocessor, a central processing unit (CPU), an application specificintegrated circuit (ASIC), a field-programmable gate array (FPGA),and/or another hardware device. Although a single processor 104 isdepicted, it should be understood that the parking processing node 107may include multiple processors, multiple cores, or the like, withoutdeparting from the scope of the parking processing node 107 system.

The parking processing node 107 may also include a non-transitorycomputer readable medium 112 that may have stored thereonmachine-readable instructions executable by the processor 104. Examplesof the machine-readable instructions are shown as 114-120 and arefurther discussed below. Examples of the non-transitory computerreadable medium 112 may include an electronic, magnetic, optical, orother physical storage device that contains or stores executableinstructions. For example, the non-transitory computer readable medium112 may be a Random Access memory (RAM), an Electrically ErasableProgrammable Read-Only Memory (EEPROM), a hard disk, an optical disc, orother type of storage device.

The processor 104 may execute the machine-readable instructions 114 todetect a parking of a transport 102 at an event location. Each of thetransports 102 and 105 may serve as a network node on a blockchainnetwork 106. As discussed above, the blockchain ledger 108 may storetransport relocation transactions 110. The blockchain 106 network may beconfigured to use one or more smart contracts that may managetransactions for the participating transport nodes 102 and 105. Theparking processing node 107 may provide the transport relocation-relatedinformation to the blockchain 106 to be stored on a ledger 108.

The processor 104 may execute the machine-readable instructions 116 toaccess a device of a transport occupant to determine a transport 102pickup location and a pickup time based on a conclusion of an event. Theprocessor 104 may execute the machine-readable instructions 118 todetect from the device of the transport 102 occupant at least onemodification of the pickup location and the pickup time made based on anupdated conclusion of the event. The processor 104 may execute themachine-readable instructions 120 to send a command to move thetransport 102 to a location proximate to the event based on the modifiedpickup location and the modified pickup time.

FIG. 1C illustrates a network diagram for vacancy processing. Referringto FIG. 1C, the network diagram 121 includes a transport node 102connected to other transport nodes 105 over a blockchain network 106.The transport nodes 102 and 105 may represent transports/vehicles. Theblockchain network 106 may have ledger 108 for storing data, such astransport locations and vacancy-related transactions 110 that record thetimestamps, and other related data. The transport node 102 may beconnected to a destination processing node 107 via the blockchain 106.

While this example describes in detail only one destination processingnode 107, multiple such nodes may be connected to the blockchain 106. Itshould be understood that the destination processing node 107 mayinclude additional components and that some of the components describedherein may be removed and/or modified without departing from a scope ofthe destination processing node 107 disclosed herein. The destinationprocessing node 107 may have a computing device or a server computer, orthe like, and may include a processor 104′, which may be asemiconductor-based microprocessor, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field-programmablegate array (FPGA), and/or another hardware device. Although a singleprocessor 104 is depicted, it should be understood that the destinationprocessing node 107 may include multiple processors, multiple cores, orthe like, without departing from the scope of the destination processingnode 107 system.

The destination processing node 107 may also include a non-transitorycomputer readable medium 112′ that may have stored thereonmachine-readable instructions executable by the processor 104. Examplesof the machine-readable instructions are shown as 113-119 and arefurther discussed below. Examples of the non-transitory computerreadable medium 112′ may include an electronic, magnetic, optical, orother physical storage device that contains or stores executableinstructions. For example, the non-transitory computer readable medium112′ may be a Random Access memory (RAM), an Electrically ErasableProgrammable Read-Only Memory (EEPROM), a hard disk, an optical disc, orother type of storage device.

The processor 104 may execute the machine-readable instructions 113 toreceive a notification from a transport 102 regarding a probablevacancy. Each of the transports 102 and 105 may serve as a network nodeon a blockchain network 106. As discussed above, the blockchain ledger108 may store vacancy-related transactions 110. The blockchain 106network may be configured to use one or more smart contracts that maymanage transactions for the participating transport nodes 102 and 105.The destination processing node 107 may provide the vacancy-relatedinformation to the blockchain 106 to be stored on a ledger 108.

The processor 104 may execute the machine-readable instructions 115 todetermine a probable time of availability and a location of the vacancybased on the notification. The processor 104 may execute themachine-readable instructions 117 to query a plurality of transports 105in a proximity of the vacancy. The processor 104 may execute themachine-readable instructions 119 to assign the location of the vacancyto a specific transport of the plurality of the transports 105.

FIG. 1D illustrates a network diagram for locating a vacant parking spotby at transport. Referring to FIG. 1D, the network diagram 130 includesa transport node 102 (e.g., a vehicle) connected to other transportnodes 105 over a blockchain network 106 that has a ledger 108 forstoring parking vacancy information and transactions 110. The transportnodes 105 may also serve as blockchain 106 peers. While this exampledescribes in detail only one transport node 102, multiple such nodes maybe connected to the blockchain 106. It should be understood that thetransport node 102 may include additional components and that some ofthe components described herein may be removed and/or modified withoutdeparting from a scope of the transport node 102 disclosed herein. Thetransport node 102 may have a computing device or a server computer, orthe like, and may include a processor 104, which may be asemiconductor-based microprocessor, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field-programmablegate array (FPGA), and/or another hardware device. Although a singleprocessor 104 is depicted, it should be understood that the transportnode 102 may include multiple processors, multiple cores, or the like,without departing from the scope of the transport node 102.

The transport node 102 may also include a non-transitory computerreadable medium 112″ that may have stored thereon machine-readableinstructions executable by the processor 104. Examples of themachine-readable instructions are shown as 121-125 and are furtherdiscussed below. Examples of the non-transitory computer readable medium112″ may include an electronic, magnetic, optical, or other physicalstorage device that contains or stores executable instructions. Forexample, the non-transitory computer readable medium 112″ may be aRandom Access memory (RAM), an Electrically Erasable ProgrammableRead-Only Memory (EEPROM), a hard disk, an optical disc, or other typeof storage device.

The processor 104 may execute the machine-readable instructions 132 toquery a plurality of transports 105 within a parking area for a parkingspot to be vacated. The blockchain 106 may be configured to use one ormore smart contracts that manage transactions for multiple participatingnodes 105. The transport node 102 may provide vacancy information to theblockchain 106 and this transaction may be stored on the ledger 108.

The processor 104 may execute the machine-readable instructions 134 toreceive verification to vacate the parking spots from the plurality oftransports within the parking area The processor 104 may execute themachine-readable instructions 136 to determine locations of the parkingspots to be vacated based on the verifications.

FIG. 2A illustrates a blockchain architecture configuration 200,according to example embodiments. Referring to FIG. 2A, the blockchainarchitecture 200 may include certain blockchain elements, for example, agroup of blockchain member nodes 202-206 as part of a blockchain group210. In one example embodiment, a permissioned blockchain is notaccessible to all parties but only to those members with permissionedaccess to the blockchain data. The blockchain nodes participate in anumber of activities, such as blockchain entry addition and validationprocess (consensus). One or more of the blockchain nodes may endorseentries based on an endorsement policy and may provide an orderingservice for all blockchain nodes. A blockchain node may initiate ablockchain action (such as an authentication) and seek to write to ablockchain immutable ledger stored in the blockchain, a copy of whichmay also be stored on the underpinning physical infrastructure.

The blockchain transactions 220 are stored in memory of computers as thetransactions are received and approved by the consensus model dictatedby the members' nodes. Approved transactions 226 are stored in currentblocks of the blockchain and committed to the blockchain via a committalprocedure, which includes performing a hash of the data contents of thetransactions in a current block and referencing a previous hash of aprevious block. Within the blockchain, one or more smart contracts 230may exist that define the terms of transaction agreements and actionsincluded in smart contract executable application code 232, such asregistered recipients, vehicle features, requirements, permissions,sensor thresholds, etc. The code may be configured to identify whetherrequesting entities are registered to receive vehicle services, whatservice features they are entitled/required to receive given theirprofile statuses and whether to monitor their actions in subsequentevents. For example, when a service event occurs and a user is riding inthe vehicle, the sensor data monitoring may be triggered, and a certainparameter, such as a vehicle charge level, may be identified as beingabove/below a particular threshold for a particular period of time. Thenthe result may be a change to a current status, which requires an alertto be sent to the managing party (i.e., vehicle owner, vehicle operator,server, etc.) so the service can be identified and stored for reference.The vehicle sensor data collected may be based on types of sensor dataused to collect information about vehicle's status. The sensor data mayalso be the basis for the vehicle event data 234, such as a location(s)to be traveled, an average speed, a top speed, acceleration rates,whether there were any collisions, was the expected route taken, what isthe next destination, whether safety measures are in place, whether thevehicle has enough charge/fuel, etc. All such information may be thebasis of smart contract terms 230, which are then stored in ablockchain. For example, sensor thresholds stored in the smart contractcan be used as the basis for whether a detected service is necessary andwhen and where the service should be performed.

FIG. 2B illustrates a shared ledger configuration, according to exampleembodiments. Referring to FIG. 2B, the blockchain logic example 250includes a blockchain application interface 252 as an API or plug-inapplication that links to the computing device and execution platformfor a particular transaction. The blockchain configuration 250 mayinclude one or more applications which are linked to applicationprogramming interfaces (APIs) to access and execute storedprogram/application code (e.g., smart contract executable code, smartcontracts, etc.) which can be created according to a customizedconfiguration sought by participants and can maintain their own state,control their own assets, and receive external information. This can bedeployed as an entry and installed, via appending to the distributedledger, on all blockchain nodes.

The smart contract application code 254 provides a basis for theblockchain transactions by establishing application code which whenexecuted causes the transaction terms and conditions to become active.The smart contract 230, when executed, causes certain approvedtransactions 226 to be generated, which are then forwarded to theblockchain platform 262. The platform includes a security/authorization268, computing devices, which execute the transaction management 266 anda storage portion 264 as a memory that stores transactions and smartcontracts in the blockchain.

The blockchain platform may include various layers of blockchain data,services (e.g., cryptographic trust services, virtual executionenvironment, etc.), and underpinning physical computer infrastructurethat may be used to receive and store new entries and provide access toauditors which are seeking to access data entries. The blockchain mayexpose an interface that provides access to the virtual executionenvironment necessary to process the program code and engage thephysical infrastructure. Cryptographic trust services may be used toverify entries such as asset exchange entries and keep informationprivate.

The blockchain architecture configuration of FIGS. 2A and 2B may processand execute program/application code via one or more interfaces exposed,and services provided, by the blockchain platform. As a non-limitingexample, smart contracts may be created to execute reminders, updates,and/or other notifications subject to the changes, updates, etc. Thesmart contracts can themselves be used to identify rules associated withauthorization and access requirements and usage of the ledger. Forexample, the information may include a new entry, which may be processedby one or more processing entities (e.g., processors, virtual machines,etc.) included in the blockchain layer. The result may include adecision to reject or approve the new entry based on the criteriadefined in the smart contract and/or a consensus of the peers. Thephysical infrastructure may be utilized to retrieve any of the data orinformation described herein.

Within smart contract executable code, a smart contract may be createdvia a high-level application and programming language, and then writtento a block in the blockchain. The smart contract may include executablecode, which is registered, stored, and/or replicated with a blockchain(e.g., distributed network of blockchain peers). An entry is anexecution of the smart contract code, which can be performed in responseto conditions associated with the smart contract being satisfied. Theexecuting of the smart contract may trigger a trusted modification(s) toa state of a digital blockchain ledger. The modification(s) to theblockchain ledger caused by the smart contract execution may beautomatically replicated throughout the distributed network ofblockchain peers through one or more consensus protocols.

The smart contract may write data to the blockchain in the format ofkey-value pairs. Furthermore, the smart contract code can read thevalues stored in a blockchain and use them in application operations.The smart contract code can write the output of various logic operationsinto the blockchain. The code may be used to create a temporary datastructure in a virtual machine or other computing platform. Data writtento the blockchain can be public and/or can be encrypted and maintainedas private. The temporary data that is used/generated by the smartcontract is held in memory by the supplied execution environment, thendeleted once the data needed for the blockchain is identified.

A smart contract executable code may include the code interpretation ofa smart contract, with additional features. As described herein, thesmart contract executable code may be program code deployed on acomputing network, where it is executed and validated by chainvalidators together during a consensus process. The smart contractexecutable code receives a hash and retrieves from the blockchain a hashassociated with the data template created by use of a previously storedfeature extractor. If the hashes of the hash identifier and the hashcreated from the stored identifier template data match, then the smartcontract executable code sends an authorization key to the requestedservice. The smart contract executable code may write to the blockchaindata associated with the cryptographic details.

FIG. 2C illustrates a blockchain configuration for storing blockchaintransaction data, according to example embodiments. Referring to FIG.2C, the example configuration 270 provides for the vehicle 272, the userdevice 274 and a server 276 sharing information with a distributedledger (i.e., blockchain) 278. The server may represent a serviceprovider entity inquiring with a vehicle service provider to share userprofile rating information in the event that a known and establisheduser profile is attempting to rent a vehicle with an established ratedprofile. The server 276 may be receiving and processing data related toa vehicle's service requirements. As the service events occur, such asthe vehicle sensor data indicates a need for fuel/charge, a maintenanceservice, etc., a smart contract may be used to invoke rules, thresholds,sensor information gathering, etc., which may be used to invoke thevehicle service event. The blockchain transaction data 280 is saved foreach transaction, such as the access event, the subsequent updates to avehicle's service status, event updates, etc. The transactions mayinclude the parties, the requirements (e.g., 18 years of age, serviceeligible candidate, valid driver's license, etc.), compensation levels,the distance traveled during the event, the registered recipientspermitted to access the event and host a vehicle service,rights/permissions, sensor data retrieved during the vehicle eventoperation to log details of the next service event and identify avehicle's condition status, and thresholds used to make determinationsabout whether the service event was completed and whether the vehicle'scondition status has changed.

FIG. 3A illustrates a flow diagram 300, according to exampleembodiments. Referring to FIG. 3A, an example method may be executed bythe parking processing node 107 (see FIG. 1B). It should be understoodthat method 300 depicted in FIG. 3A may include additional operationsand that some of the operations described therein may be removed and/ormodified without departing from the scope of the method 300. Thedescription of the method 300 is also made with reference to thefeatures depicted in FIG. 1B for purposes of illustration. Particularly,the processor 104 of the parking processing node 107 may execute some orall of the operations included in the method 300.

With reference to FIG. 3A, at block 302, the processor 104′ may detect aparking of a transport at an event location. At block 304, the processor104′ may access a device of a transport occupant to determine atransport pickup location and a pickup time based on a conclusion of anevent. At block 306, the processor 104′ may detect from the device ofthe transport occupant at least one modification of the pickup locationand the pickup time made based on an updated conclusion of the event. Atblock 308, the processor 104′ may send a command to move the transportto a location proximate to the event based on the modified pickuplocation and the modified pickup time.

FIG. 3B illustrates a flow diagram 320 of an example method, accordingto example embodiments. Referring to FIG. 3B, the method 320 may alsoinclude one or more of the following steps. At block 322, the processor104′ may instruct the transport to move to the pickup location when thedevice of the transport occupant approaches to the modified pickuplocation. At block 324, the processor 104′ may detect the parking of thetransport at an event location based on video data received from atleast one camera. At block 326, the processor 104′ may query the deviceof the transport occupant to determine a conclusion time of the event.At block 328, the processor 104′ may receive an agreement to move thetransport from the device of the transport occupant. Note that theagreement may constitute a consensus of a blockchain. At block 329, theprocessor 104′ may execute a smart contract to query the device of thetransport occupant for the transport pickup location and the pickuptime.

FIG. 3C illustrates a flow diagram 330, according to exampleembodiments. Referring to FIG. 3C, an example method may be executed bythe destination processing node 107 (see FIG. 1C). It should beunderstood that method 330 depicted in FIG. 3C may include additionaloperations and that some of the operations described therein may beremoved and/or modified without departing from the scope of the method330. The description of the method 330 is also made with reference tothe features depicted in FIG. 1C for purposes of illustration.Particularly, the processor 104 of destination processing node 107 mayexecute some or all of the operations included in the method 330.

With reference to FIG. 3C, at block 333, the processor 104′ may receivea notification from a transport regarding a probable vacancy. At block335, the processor 104′ may determine a probable time of availabilityand a location of the vacancy based on the notification. At block 337,the processor 104′ may query a plurality of transports in a proximity ofthe vacancy. At block 339, the processor 104 may assign the location ofthe vacancy to a specific transport of the plurality of the transports.

FIG. 3D illustrates a flow diagram 340 of an example method, accordingto example embodiments. Referring to FIG. 3D, the method 342 may alsoinclude one or more of the following steps. At block 342, the processor104 may determine a time of the probable vacancy by recognizing a userof the transport is proximate to the transport based on data acquiredfrom at least one sensor on the transport. At block 344, the processor104 may query the plurality of the transports within a pre-defineddistance from the location of the vacancy. At block 346, the processor104 may provide the location of the vacancy to the specific transportthat will be nearest to the vacancy at a time after the probable time ofavailability. At block 348, the processor 104 may, responsive toreceiving agreements from the plurality of the transports, provide thelocation of the vacancy to the specific transport. Note that theplurality of the transports may be associated with a blockchainconsensus. At block 350, the processor 104 may execute a smart contractto query the plurality of the transports proximate to the vacancy foragreements to occupy the location of the vacancy.

FIG. 3E illustrates a flow diagram 360, according to exampleembodiments. Referring to FIG. 3E, an example method may be executed bythe transport node 102 (see FIG. 1D). It should be understood thatmethod 360 depicted in FIG. 3E may include additional operations andthat some of the operations described therein may be removed and/ormodified without departing from the scope of the method 360. Thedescription of the method 360 is also made with reference to thefeatures depicted in FIG. 1D for purposes of illustration. Particularly,the processor 104 of the transport node 102 may execute some or all ofthe operations included in the method 360.

With reference to FIG. 3E, at block 362, the processor 104 may query aplurality of transports within a parking area for a parking spot to bevacated. At block 364, the processor 104 may receive verification tovacate the parking spots from the plurality of transports within theparking area At block 366, the processor 104 may determine locations ofthe parking spots to be vacated based on the verifications.

FIG. 3F illustrates a flow diagram 380 of an example method, accordingto example embodiments. Referring to FIG. 3F, the method 380 may alsoinclude one or more of the following steps. At block 382, the processor104 may determine times of vacations of the parking spots based on theagreements. At block 384, the processor 104 may select a parking spotbased on an earliest time of a vacation of the parking spot and tonotify the transport currently in the selected parking spot. At block386, the processor 104 may select a parking spot nearest to thetransport based on the locations. At block 388, the processor 104 mayquery the plurality of the transports within a pre-defined distance froma location of the transport. Note that the verifications may represent ablockchain consensus among the transports. At block 390, the processor104 may execute a smart contract to query the plurality of thetransports within the parking area for the parking spot to be vacated.

FIG. 4A illustrates an example blockchain vehicle configuration 400 formanaging blockchain transactions associated with a vehicle, according toexample embodiments. Referring to FIG. 4A, as a particulartransport/vehicle 425 is engaged in transactions, such as asset transfertransactions (e.g., access key exchanges, vehicle service, dealertransactions, delivery/pickup, transportation services, etc.). Thevehicle 425 may receive assets 410 and/or expel/transfer assets 412according to a transaction(s) defined by smart contracts. Thetransaction module 420 may record information, such as parties, credits,service descriptions, date, time, location, results, notifications,unexpected events, etc. Those transactions in the transaction module 420may be replicated into a blockchain 430, which may be managed by aremote server and/or by a remote blockchain peers, among which thevehicle 425 itself may represent a blockchain member and/or blockchainpeer. In other embodiments, the blockchain 430 resides on the vehicle425. The assets received and/or transferred can be based on location andconsensus as described herein.

FIG. 4B illustrates an example blockchain vehicle configuration 440 formanaging blockchain transactions between a service node (e.g., a gasstation, a service center, a body shop, a rental center, automotivedealer, local service stop, delivery pickup center, etc.) and a vehicle,according to example embodiments. In this example, the vehicle 425 mayhave driven itself to a service node 442, because the vehicle needsservice and/or needs to stop at a particular location. The service node442 may perform a service (e.g., pump gas) or may register the vehicle425 for a service call at a particular time, with a particular strategy,such as oil change, battery charge or replacement, tire change orreplacement, and any other transport related service. The servicesrendered 444 may be performed based on a smart contract, which isdownloaded from or accessed via the blockchain 430 and identified forpermission to perform such services for a particular rate of exchange.The services may be logged in the transaction log of the transactionmodule 420, the credits 412 are transferred to the service center 442and the blockchain may log transactions to represent all the informationregarding the recent service. In other embodiments, the blockchain 430resides on the vehicle 425 and/or the service center server. In oneexample, a transport event may require a refuel or other vehicle serviceand the occupants may then be responsible for the asset value increasefor such service. The service may be rendered via a blockchainnotification, which is then used to redistribute the asset value to theoccupants via their respective asset values. Responsibility for theservice center activities can be based on asset transfer as describedherein.

FIG. 4C illustrates an example blockchain vehicle configuration 450 formanaging blockchain transactions conducted among various vehicles,according to the exemplary embodiments. The vehicle 425 may engage withanother vehicle 408 to perform various actions such as to share accesskeys, transfer keys, acquire service calls, etc. when the vehicle hasreached a status where the assets need to be shared with anothervehicle. For example, the vehicle 408 may be due for a battery chargeand/or may have an issue with a tire and may be in route to pick up apackage for delivery. The vehicle 408 may notify another vehicle 425which is in its network and which operates on its blockchain memberservice. The vehicle 425 may then receive the information via a wirelesscommunication request to perform the package pickup from the vehicle 408and/or from a server (not shown). The transactions are logged in thetransaction modules 452 and 420 of both vehicles. The assets aretransferred from vehicle 408 to vehicle 425 and the record of the assettransfer is logged in the blockchain 430/454 assuming that theblockchains are different from one another, or, are logged in the sameblockchain used by all members. Responsibility for the transferredassets can be based on asset values (e.g., access keys) as describedherein.

FIG. 5 illustrates blockchain blocks 500 that can be added to adistributed ledger, according to example embodiments, and contents ofblock structures 502A to 502 n. Referring to FIG. 5 , clients (notshown) may submit entries to blockchain nodes to enact activity on theblockchain. As an example, clients may be applications that act onbehalf of a requester, such as a device, person or entity to proposeentries for the blockchain. The plurality of blockchain peers (e.g.,blockchain nodes) may maintain a state of the blockchain network and acopy of the distributed ledger. Different types of blockchainnodes/peers may be present in the blockchain network including endorsingpeers, which simulate and endorse entries proposed by clients andcommitting peers which verify endorsements, validate entries, and commitentries to the distributed ledger. In this example, the blockchain nodesmay perform the role of endorser node, committer node, or both.

The instant system includes a blockchain which stores immutable,sequenced records in blocks, and a state database (current world state)maintaining a current state of the blockchain. One distributed ledgermay exist per channel and each peer maintains its own copy of thedistributed ledger for each channel of which they are a member. Theinstant blockchain is an entry log, structured as hash-linked blockswhere each block contains a sequence of N entries. Blocks may includevarious components such as those shown in FIG. 5 . The linking of theblocks may be generated by adding a hash of a prior block's headerwithin a block header of a current block. In this way, all entries onthe blockchain are sequenced and cryptographically linked togetherpreventing tampering with blockchain data without breaking the hashlinks. Furthermore, because of the links, the latest block in theblockchain represents every entry that has come before it. The instantblockchain may be stored on a peer file system (local or attachedstorage), which supports an append-only blockchain workload.

The current state of the blockchain and the distributed ledger may bestored in the state database. Here, the current state data representsthe latest values for all keys ever included in the chain entry log ofthe blockchain. Smart contract executable code invocations executeentries against the current state in the state database. To make thesesmart contract executable code interactions extremely efficient, thelatest values of all keys are stored in the state database. The statedatabase may include an indexed view into the entry log of theblockchain, it can therefore be regenerated from the chain at any time.The state database may automatically get recovered (or generated ifneeded) upon peer startup, before entries are accepted.

Endorsing nodes receive entries from clients and endorse the entry basedon simulated results. Endorsing nodes hold smart contracts whichsimulate the entry proposals. When an endorsing node endorses an entry,the endorsing nodes creates an entry endorsement which is a signedresponse from the endorsing node to the client application indicatingthe endorsement of the simulated entry. The method of endorsing an entrydepends on an endorsement policy which may be specified within smartcontract executable code. An example of an endorsement policy is “themajority of endorsing peers must endorse the entry.” Different channelsmay have different endorsement policies. Endorsed entries are forward bythe client application to an ordering service.

The ordering service accepts endorsed entries, orders them into a block,and delivers the blocks to the committing peers. For example, theordering service may initiate a new block when a threshold of entrieshas been reached, a timer times out, or another condition. In thisexample, blockchain node is a committing peer that has received a datablock 602A for storage on the blockchain. The ordering service may bemade up of a cluster of orderers. The ordering service does not processentries, smart contracts, or maintain the shared ledger. Rather, theordering service may accept the endorsed entries and specifies the orderin which those entries are committed to the distributed ledger. Thearchitecture of the blockchain network may be designed such that thespecific implementation of ‘ordering’ (e.g., Solo, Kafka, BFT, etc.)becomes a pluggable component.

Entries are written to the distributed ledger in a consistent order. Theorder of entries is established to ensure that the updates to the statedatabase are valid when they are committed to the network. Unlike acrypto-currency blockchain system (e.g., Bitcoin, etc.) where orderingoccurs through the solving of a cryptographic puzzle, or mining, in thisexample the parties of the distributed ledger may choose the orderingmechanism that best suits that network.

Referring to FIG. 5 , a block 502A (also referred to as a data block)that is stored on the blockchain and/or the distributed ledger mayinclude multiple data segments such as a block header 504A to 504 n,transaction specific data 506A to 506 n, and block metadata 508A to 508n. It should be appreciated that the various depicted blocks and theircontents, such as block 502A and its contents are merely for purposes ofan example and are not meant to limit the scope of the exampleembodiments. In some cases, both the block header 504A and the blockmetadata 508A may be smaller than the transaction specific data 506Awhich stores entry data; however, this is not a requirement. The block502A may store transactional information of N entries (e.g., 100, 500,1000, 2000, 3000, etc.) within the block data 510A to 510 n. The block502A may also include a link to a previous block (e.g., on theblockchain) within the block header 504A. In particular, the blockheader 504A may include a hash of a previous block's header. The blockheader 504A may also include a unique block number, a hash of the blockdata 510A of the current block 502A, and the like. The block number ofthe block 502A may be unique and assigned in an incremental/sequentialorder starting from zero. The first block in the blockchain may bereferred to as a genesis block which includes information about theblockchain, its members, the data stored therein, etc.

The block data 510A may store entry information of each entry that isrecorded within the block. For example, the entry data may include oneor more of a type of the entry, a version, a timestamp, a channel ID ofthe distributed ledger, an entry ID, an epoch, a payload visibility, asmart contract executable code path (deploy tx), a smart contractexecutable code name, a smart contract executable code version, input(smart contract executable code and functions), a client (creator)identify such as a public key and certificate, a signature of theclient, identities of endorsers, endorser signatures, a proposal hash,smart contract executable code events, response status, namespace, aread set (list of key and version read by the entry, etc.), a write set(list of key and value, etc.), a start key, an end key, a list of keys,a Merkel tree query summary, and the like. The entry data may be storedfor each of the N entries.

In some embodiments, the block data 510A may also store transactionspecific data 506A which adds additional information to the hash-linkedchain of blocks in the blockchain. Accordingly, the data 506A can bestored in an immutable log of blocks on the distributed ledger. Some ofthe benefits of storing such data 506A are reflected in the variousembodiments disclosed and depicted herein. The block metadata 508A maystore multiple fields of metadata (e.g., as a byte array, etc.).Metadata fields may include signature on block creation, a reference toa last configuration block, an entry filter identifying valid andinvalid entries within the block, last offset persisted of an orderingservice that ordered the block, and the like. The signature, the lastconfiguration block, and the orderer metadata may be added by theordering service. Meanwhile, a committer of the block (such as ablockchain node) may add validity/invalidity information based on anendorsement policy, verification of read/write sets, and the like. Theentry filter may include a byte array of a size equal to the number ofentries in the block data 510A and a validation code identifying whetheran entry was valid/invalid.

The other blocks 502B to 502 n in the blockchain also have headers,files, and values. However, unlike the first block 502A, each of theheaders 504A to 504 n in the other blocks includes the hash value of animmediately preceding block. The hash value of the immediately precedingblock may be just the hash of the header of the previous block or may bethe hash value of the entire previous block. By including the hash valueof a preceding block in each of the remaining blocks, a trace can beperformed from the Nth block back to the genesis block (and theassociated original file) on a block-by-block basis, as indicated byarrows 512, to establish an auditable and immutable chain-of-custody.

The above embodiments may be implemented in hardware, in a computerprogram executed by a processor, in firmware, or in a combination of theabove. A computer program may be embodied on a computer readable medium,such as a storage medium. For example, a computer program may reside inrandom access memory (“RAM”), flash memory, read-only memory (“ROM”),erasable programmable read-only memory (“EPROM”), electrically erasableprogrammable read-only memory (“EEPROM”), registers, hard disk, aremovable disk, a compact disk read-only memory (“CD-ROM”), or any otherform of storage medium known in the art.

An exemplary storage medium may be coupled to the processor such thatthe processor may read information from, and write information to, thestorage medium. In the alternative, the storage medium may be integralto the processor. The processor and the storage medium may reside in anapplication specific integrated circuit (“ASIC”). In the alternative,the processor and the storage medium may reside as discrete components.For example, FIG. 6 illustrates an example computer system architecture600, which may represent or be integrated in any of the above-describedcomponents, etc.

FIG. 6 is not intended to suggest any limitation as to the scope of useor functionality of embodiments of the application described herein.Regardless, the computing node 600 is capable of being implementedand/or performing any of the functionality set forth hereinabove.

In computing node 600 there is a computer system/server 602, which isoperational with numerous other general purpose or special purposecomputing system environments or configurations. Examples of well-knowncomputing systems, environments, and/or configurations that may besuitable for use with computer system/server 602 include, but are notlimited to, personal computer systems, server computer systems, thinclients, thick clients, hand-held or laptop devices, multiprocessorsystems, microprocessor-based systems, set top boxes, programmableconsumer electronics, network PCs, minicomputer systems, mainframecomputer systems, and distributed cloud computing environments thatinclude any of the above systems or devices, and the like.

Computer system/server 602 may be described in the general context ofcomputer system-executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 602 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

As shown in FIG. 6 , computer system/server 602 in cloud computing node600 is shown in the form of a general-purpose computing device. Thecomponents of computer system/server 602 may include, but are notlimited to, one or more processors or processing units 604, a systemmemory 606, and a bus that couples various system components includingsystem memory 606 to processor 604.

The bus represents one or more of any of several types of busstructures, including a memory bus or memory controller, a peripheralbus, an accelerated graphics port, and a processor or local bus usingany of a variety of bus architectures. By way of example, and notlimitation, such architectures include Industry Standard Architecture(ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA)bus, Video Electronics Standards Association (VESA) local bus, andPeripheral Component Interconnects (PCI) bus.

Computer system/server 602 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 602, and it includes both volatileand non-volatile media, removable and non-removable media. System memory606, in one embodiment, implements the flow diagrams of the otherfigures. The system memory 606 can include computer system readablemedia in the form of volatile memory, such as random-access memory (RAM)608 and/or cache memory 610. Computer system/server 602 may furtherinclude other removable/non-removable, volatile/non-volatile computersystem storage media. By way of example only, memory 606 can be providedfor reading from and writing to a non-removable, non-volatile magneticmedia (not shown and typically called a “hard drive”). Although notshown, a magnetic disk drive for reading from and writing to aremovable, non-volatile magnetic disk (e.g., a “floppy disk”), and anoptical disk drive for reading from or writing to a removable,non-volatile optical disk such as a CD-ROM, DVD-ROM or other opticalmedia can be provided. In such instances, each can be connected to thebus by one or more data media interfaces. As will be further depictedand described below, memory 606 may include at least one program producthaving a set (e.g., at least one) of program modules that are configuredto carry out the functions of various embodiments of the application.

Program/utility, having a set (at least one) of program modules, may bestored in memory 606 by way of example, and not limitation, as well asan operating system, one or more application programs, other programmodules, and program data. Each of the operating system, one or moreapplication programs, other program modules, and program data or somecombination thereof, may include an implementation of a networkingenvironment. Program modules generally carry out the functions and/ormethodologies of various embodiments of the application as describedherein.

As will be appreciated by one skilled in the art, aspects of the presentapplication may be embodied as a system, method, or computer programproduct. Accordingly, aspects of the present application may take theform of an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present application may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Computer system/server 602 may also communicate with one or moreexternal devices via an I/O adapter 612, such as a keyboard, a pointingdevice, a display, etc.; one or more devices that enable a user tointeract with computer system/server 602; and/or any devices (e.g.,network card, modem, etc.) that enable computer system/server 602 tocommunicate with one or more other computing devices. Such communicationcan occur via I/O interfaces of the adapter 612. Still yet, computersystem/server 602 can communicate with one or more networks such as alocal area network (LAN), a general wide area network (WAN), and/or apublic network (e.g., the Internet) via a network adapter. As depicted,adapter 612 communicates with the other components of computersystem/server 602 via a bus. It should be understood that although notshown, other hardware and/or software components could be used inconjunction with computer system/server 602. Examples, include, but arenot limited to: microcode, device drivers, redundant processing units,external disk drive arrays, RAID systems, tape drives, and data archivalstorage systems, etc.

Although an exemplary embodiment of at least one of a system, method,and non-transitory computer readable medium has been illustrated in theaccompanied drawings and described in the foregoing detaileddescription, it will be understood that the application is not limitedto the embodiments disclosed, but is capable of numerous rearrangements,modifications, and substitutions as set forth and defined by thefollowing claims. For example, the capabilities of the system of thevarious figures can be performed by one or more of the modules orcomponents described herein or in a distributed architecture and mayinclude a transmitter, receiver or pair of both. For example, all orpart of the functionality performed by the individual modules, may beperformed by one or more of these modules. Further, the functionalitydescribed herein may be performed at various times and in relation tovarious events, internal or external to the modules or components. Also,the information sent between various modules can be sent between themodules via at least one of: a data network, the Internet, a voicenetwork, an Internet Protocol network, a wireless device, a wired deviceand/or via plurality of protocols. Also, the messages sent or receivedby any of the modules may be sent or received directly and/or via one ormore of the other modules.

One skilled in the art will appreciate that a “system” could be embodiedas a personal computer, a server, a console, a personal digitalassistant (PDA), a cell phone, a tablet computing device, a smartphoneor any other suitable computing device, or combination of devices.Presenting the above-described functions as being performed by a“system” is not intended to limit the scope of the present applicationin any way but is intended to provide one example of many embodiments.Indeed, methods, systems and apparatuses disclosed herein may beimplemented in localized and distributed forms consistent with computingtechnology.

It should be noted that some of the system features described in thisspecification have been presented as modules, in order to moreparticularly emphasize their implementation independence. For example, amodule may be implemented as a hardware circuit comprising custom verylarge-scale integration (VLSI) circuits or gate arrays, off-the-shelfsemiconductors such as logic chips, transistors, or other discretecomponents. A module may also be implemented in programmable hardwaredevices such as field programmable gate arrays, programmable arraylogic, programmable logic devices, graphics processing units, or thelike.

A module may also be at least partially implemented in software forexecution by various types of processors. An identified unit ofexecutable code may, for instance, comprise one or more physical orlogical blocks of computer instructions that may, for instance, beorganized as an object, procedure, or function. Nevertheless, theexecutables of an identified module need not be physically locatedtogether but may comprise disparate instructions stored in differentlocations which, when joined logically together, comprise the module andachieve the stated purpose for the module. Further, modules may bestored on a computer-readable medium, which may be, for instance, a harddisk drive, flash device, random access memory (RAM), tape, or any othersuch medium used to store data.

Indeed, a module of executable code could be a single instruction, ormany instructions, and may even be distributed over several differentcode segments, among different programs, and across several memorydevices. Similarly, operational data may be identified and illustratedherein within modules and may be embodied in any suitable form andorganized within any suitable type of data structure. The operationaldata may be collected as a single data set or may be distributed overdifferent locations including over different storage devices, and mayexist, at least partially, merely as electronic signals on a system ornetwork.

It will be readily understood that the components of the application, asgenerally described and illustrated in the figures herein, may bearranged and designed in a wide variety of different configurations.Thus, the detailed description of the embodiments is not intended tolimit the scope of the application as claimed but is merelyrepresentative of selected embodiments of the application.

One having ordinary skill in the art will readily understand that theabove may be practiced with steps in a different order, and/or withhardware elements in configurations that are different than those whichare disclosed. Therefore, although the application has been describedbased upon these preferred embodiments, it would be apparent to those ofskill in the art that certain modifications, variations, and alternativeconstructions would be apparent.

While preferred embodiments of the present application have beendescribed, it is to be understood that the embodiments described areillustrative only and the scope of the application is to be definedsolely by the appended claims when considered with a full range ofequivalents and modifications (e.g., protocols, hardware devices,software platforms etc.) thereto.

What is claimed is:
 1. A method, comprising: detecting, by a processingnode, a parking of a transport at a location associated with an event;determining, by the processing node, a pickup location and a pickup timeof the transport based on a conclusion of the event; determining, by theprocessing node, a modified pickup time by the transport based on aconclusion of the event; and responsive to the modified pickup time,moving the transport to an intermediate location between the location ofthe parked transport and a modified pickup location based on themodified pickup time.
 2. The method of claim 1, comprising moving thetransport to the modified pickup location when a device associated withthe transport approaches the modified pickup location.
 3. The method ofclaim 1, comprising detecting the parking of the transport at thelocation based on video data received from at least one camera.
 4. Themethod of claim 1, comprising detecting the parking of the transport atthe location based on a change in transport operation status.
 5. Themethod of claim 1, comprising detecting the parking of the transport atthe location based on a transport sensor indicating an occupant of thetransport has exited the transport.
 6. The method of claim 1, comprisingreceiving an agreement to move the transport from a device associatedwith a transport.
 7. The method of claim 1, comprising determining theintermediate location based on one or more vehicles vacating a parkingspot between the location of the parked transport and the modifiedpickup location.
 8. A system, comprising: a processor of a parkingprocessing node; a memory on which are stored machine readableinstructions that when executed by the processor, cause the processorto: detect, by a processing node, a parking of a transport at a locationassociated with an event; determine, by the processing node, a pickuplocation and a pickup time of the transport based on a conclusion of theevent; determine, by the processing node, a modified pickup time by thetransport based on a conclusion of the event; and responsive to themodified pickup time, move the transport to an intermediate locationbetween the location of the parked transport and a modified pickuplocation based on the modified pickup time.
 9. The system of claim 8,wherein the instructions are further to cause the processor to instructthe transport to move the transport to the modified pickup location whena device associated with the transport approaches the modified pickuplocation.
 10. The system of claim 8, wherein the instructions arefurther to cause the processor to detect the parking of the transport atthe event location based on video data received from at least onecamera.
 11. The system of claim 8, wherein the instructions are furtherto cause the processor to detect the parking of the transport at thelocation based on a change in transport operation status.
 12. The systemof claim 8, wherein the instructions are further to cause the processorto detect the parking of the transport at the location based on atransport sensor indicating an occupant of the transport has exited thetransport.
 13. The system of claim 8, wherein the instructions arefurther to cause the processor to receive an agreement to move thetransport from a device associated with a transport.
 14. The system ofclaim 8, wherein the instructions are further to cause the processor todetermine the intermediate location based on one or more vehiclesvacating a parking spot between the location of the parked transport andthe modified pickup location.
 15. A non-transitory computer readablemedium comprising instructions, that when read by a processor, cause theprocessor to perform: detecting, by a processing node, a parking of atransport at a location associated with an event; determining, by theprocessing node, a pickup location and a pickup time of the transportbased on a conclusion of the event; determining, by the processing node,a modified pickup time by the transport based on a conclusion of theevent; and responsive to the modified pickup time, moving the transportto an intermediate location between the location of the parked transportand a modified pickup location based on the modified pickup time. 16.The non-transitory computer readable medium of claim 15, furthercomprising moving the transport to the modified pickup location when adevice associated with the transport approaches the modified pickuplocation.
 17. The non-transitory computer readable medium of claim 15,further comprising detecting the parking of the transport at thelocation based on video data received from at least one camera.
 18. Thenon-transitory computer readable medium of claim 15, further comprisingdetecting the parking of the transport at the location based on a changein transport operation status.
 19. The non-transitory computer readablemedium of claim 15, further comprising detecting the parking of thetransport at the location based on a transport sensor indicating anoccupant of the transport has exited the transport.
 20. Thenon-transitory computer readable medium of claim 15, further comprisingdetermining the intermediate location based on one or more vehiclesvacating a parking spot between the location of the parked transport andthe modified pickup location.